Granularity measures and complexity measures of partition-based granular structures
نویسندگان
چکیده
منابع مشابه
Complexity measures in decomposable structures
In this paper we present some measures of complexity of decomposable structures. The literature on complexity is reviewed and then the distinction among different measures of complexity is discussed. At first, a broad definition of complex systems is provided and the main characteristics of such systems are described briefly. In particular, a complex system is defined as a network of many highl...
متن کاملEntropy measures and granularity measures for set-valued information systems
Set-valued information systems are generalized models of single-valued information systems. In this paper, we propose two new relations for set-valued information systems. Based on these two relations, the concepts of knowledge information entropy, knowledge rough entropy, knowledge granulation and knowledge granularity measure are defined in set-valued information systems, and some properties ...
متن کاملConfidence bounds of recurrence-based complexity measures
a r t i c l e i n f o a b s t r a c t In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confide...
متن کاملComplexity Measures and Cellular
A bstract . Various observables meas urin g the complexi ty of an ensemble of pattern s are discussed , in par ticul ar statistical quantit ies rela ted to the convergence of block entropies, an d comp utation t heoret ical quanti ties related to a gram matical description of t he ensem ble. T hese measures of com plexity are applied to one-dime nsio nal cellular automata, by char acterizing th...
متن کاملMeasures of ǫ-complexity
We study some measures which are related to the notion of the ǫ-complexity. We prove that measure of ǫ-complexity defined on the base of the notion of ǫ-separability is equivalent to the dual measure that is defined through ǫ-nets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2019
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2018.10.015